/* dfs&bfs algorithm for a graph */
/* author:nemo(nemokingdom@gmail.com) */
/* date:Apr. 14th,2008 */

#include "graph.h"

int main()
{
   Graph g;
   Graph *rg;
   char start[MAXLEN];
   creatGraph(&g);
/*   
     DFS(&g);
     printorder(&g);
     rg = reverse(&g);
     printf("\n");
     DFS(rg);
     printorder(rg);
     Free(rg);
     free(rg);
*/
/*   
     printf("bfs start from:\n");
     scanf("%s",start);
     BFS(&g,start);
*/
   
/*dag:   DFS(&g); */
/*    printf("your starting point:\n"); */
/*    scanf("%s",start); */
/*    dijkstra(&g,start); */
   printf("get here!\n");
   
   MST(&g);
   Free(&g);
   return 0;

}
